Fast parallel algorithms for Graeffe's root squaring technique
نویسندگان
چکیده
منابع مشابه
Squaring Construction for Repeated-Root Cyclic Codes
We considered repeated-root cyclic codes whose block length is divisible by the characteristic of the underlying field. Cyclic self dual codes are also the repeated root cyclic codes. It is known about the one-level squaring construction for binary repeated root cyclic codes. In this correspondence, we introduced of two level squaring construction for binary repeated root cyclic codes of length...
متن کاملFast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage We present a simple algorithm with run time O n p logn and an improved algorithm with run time O n p logn log log n p Both algorithms require n additional global bits and O local storage per processor If pre x summation is supported at the instruction level the run time of the ...
متن کاملParallel Processing Letters Fast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p)logn) and an improved algorithm with run time O(n/p+logn loglog(n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If preex summation is supported at the instruction level, the run ti...
متن کاملFast Parallel Algorithms for Matrixreduction to Normal
Poursuivant une s erie d'articles sur le calcul de formes normales de matrices, nous nous int eressons ici a la complexit e parall ele du calcul de transformations associ ees. Pour une matrice B de Mn;n(K), o u K est un corps commutatif, nous d emontrons que le probl eme de calculer une matrice de transformation P telle que F = P ?1 BP soit sous forme normale de Frobenius, est dans NC 2 K. Nous...
متن کاملEngineering Fast Parallel Matching Algorithms
The computation of matchings has applications in the solving process of a large variety of problems, e.g. as part of graph partitioners. We present and analyze three sequential and two parallel approximation algorithms for the cardinality and weighted matching problem. One of the sequential algorithms is based on an algorithm by Karp and Sipser to compute maximal matchings [21]. Another one is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1998
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(97)00280-0